A Generalization of Cobham's Theorem to Automata over Real Numbers
نویسندگان
چکیده
This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in the first-order additive theory of real and integer variables 〈R, Z,+, <〉 can all be recognized by weak deterministic Büchi automata, regardless of the encoding base r > 1. In this paper, we prove the reciprocal property, i.e., that a subset of R that is recognizable by weak deterministic automata in every base r > 1 is necessarily definable in 〈R, Z,+, <〉. This result generalizes to real numbers the well-known Cobham’s theorem on the finite-state recognizability of sets of integers. Our proof gives interesting insight into the internal structure of automata recognizing sets of real numbers, which may lead to efficient data structures for handling these sets.
منابع مشابه
Publications Du Groupe « Vérification Et Méthodes Formelles »
titative model-checking of one-clock timed automata under probabilistic semantics. [4] Bernard Boigelot and Julien Brusten. A generalization of cobham's theorem to automata over real numbers.
متن کاملLOGIC AND p-RECOGNIZABLE SETS OF INTEGERS
We survey the properties of sets of integers recognizable by automata when they are written in p-ary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to Nm due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of Cobham-Semenov, the original proof being published in Russian.
متن کاملRepresenting Periodic Temporal Information with Automata
Motivated by issues in temporal databases and in the verification of infinite-state systems, this talk considers the problem of representing periodic dense time information. Doing so requires handling a theory that combines discrete and continuous variables, since discrete variables are essential for representing periodicity. An automata-based approach for dealing with such a combined theory is...
متن کاملA more reasonable proof of Cobham's theorem
We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.
متن کاملA Generalization of Semenov's Theorem to Automata over Real Numbers
This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are used, in particular, as symbolic data structures for representing sets definable in the first-order theory 〈R, Z,+,≤〉, i.e., the mixed additive arithmetic of integer and real variables. They also lead to a simple decision proced...
متن کامل